The permutation classes Av(1234, 2341) and Av(1243, 2314)

نویسنده

  • David Bevan
چکیده

We investigate the structure of the two permutation classes defined by the sets of forbidden patterns {1234, 2341} and {1243, 2314}. By considering how the Hasse graphs of permutations in these classes can be built from a sequence of rooted source graphs, we determine their algebraic generating functions. Our approach is similar to that of “adding a slice”, used previously to enumerate various classes of polyominoes and other combinatorial structures. To solve the relevant functional equations, we make extensive use of the kernel method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple permutations of the classes Av(321, 3412) and Av(321, 4123) have polynomial growth

A permutation is called simple if its only blocks i.e. subsets of the permutation consist of singleton and the permutation itself. For example, 2134 is not a simple permutation since it consists of a block 213 but 3142 is a simple permutation. The basis of a class of permutations is a set of patterns, which is minimal under involvement and do not belong to the permutation. In this paper we prov...

متن کامل

Simple permutations of the classes Av(321, 13524) and Av(321, 13452) have polynomial growth

A permutation is called simple if its only blocks i.e. subsets of the permutation consist of singleton and the permutation itself. For example, 2134 is not a simple permutation since it consists of a block 213 but 3142 is a simple permutation. The basis of a permutation is a pattern which is minimal under involvement and do not belong to the permutation. In this paper, we prove that the number ...

متن کامل

Juxtaposing Catalan Permutation Classes with Monotone Ones

This talk describes a clean and unified way to enumerate all juxtaposition classes of the form “Av(abc) next to Av(xy)”, where abc is a permutation of length three and xy is a permutation of length two. The main tools are Dyck paths, decorated by sequences of points, and context free grammars, used afterwards to enumerate these decorated Dyck paths. Juxtapositions are a simple special case of p...

متن کامل

Splittings and Ramsey Properties of Permutation Classes

We say that a permutation π is merged from permutations ρ and τ , if we can color the elements of π red and blue so that the red elements are order-isomorphic to ρ and the blue ones to τ . A permutation class is a set of permutations closed under taking subpermutations. A permutation class C is splittable if it has two proper subclasses A and B such that every element of C can be obtained by me...

متن کامل

On pattern avoiding alternating permutations

An alternating permutation of length n is a permutation π = π1π2 · · ·πn such that π1 < π2 > π3 < π4 > · · · . Let An denote the set of alternating permutations of {1, 2, . . . , n}, and let An(σ) be the set of alternating permutations in An that avoid a pattern σ. Recently, Lewis used generating trees to enumerate A2n(1234), A2n(2143) and A2n+1(2143), and he posed some conjectures on the Wilf-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2016